SOME COMBINATORIAL PROBLEMS ON BINARY MATRICES IN PROGRAMMING COURSES
نویسندگان
چکیده
منابع مشابه
Some Combinatorial Problems on Binary Matrices in Programming Courses
The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to avoid checking whether each of the objects received possesses the necessary properties. This significantly improves the efficiency of the algorithm in terms of...
متن کاملSome Remarkable Combinatorial Matrices
In this paper we describe, in combinatorial terms, some matrices which arise as Laplacians connected to the three-dimensional Heisenberg Lie algebra. We pose the problem of finding the eigenvalues and eigenvectors of these matrices. We state a number of conjectures including the conjecture that all eigenvalues of these matrices are non-negative integers. We determine the eigenvalues and eigenve...
متن کاملthe second immanant of some combinatorial matrices
let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...
متن کاملSome Pitfalls in Introductory Programming Courses
This paper discusses some difficulties in teaching introductory courses to programming, paying particular attention to their mathematical nature. We consider some aspects, which have not been commented in detail in textbooks and often neglected by course outlines and schedules. Some of these are constructing complex conditions, exceeding array bound, calculating infinite series in conjunction w...
متن کاملSome new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technologies in Education
سال: 2012
ISSN: 1998-6939,2306-1707
DOI: 10.14308/ite000313